Quasipolynomial-time algorithms for Gibbs point processes

نویسندگان

چکیده

Abstract We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of Gibbs point process interacting via stable potential. This result holds all activities $\lambda$ which satisfies zero-free assumption in neighbourhood interval $[0,\lambda ]$ . As corollary, finiterange potentials, we obtain $\lambda \lt 1/(e^{B + 1} \hat C_\phi )$ where $\hat C_\phi$ is temperedness parameter and $B$ stability constant $\phi$ In special case repulsive potential such as hard-sphere gas improve range activity by factor at least $e^2$ e/\Delta _\phi$ , $\Delta potential-weighted connective Our approximates coefficients cluster expansion uses interpolation method Barvinok to extend this throughout region.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuum percolation for Gibbs point processes ∗

We consider percolation properties of the Boolean model generated by a Gibbs point process and balls with deterministic radius. We show that for a large class of Gibbs point processes there exists a critical activity, such that percolation occurs a.s. above criticality.

متن کامل

Signaling in Quasipolynomial time

Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its players. The signaling problem abstracts the task faced by an informed “market maker”, who must choose how to reveal information in order to effect a desirable equilibrium. In this paper, we consider two fundamental sig...

متن کامل

Algorithms for Point Processes Analysis

A time point process can be defined either by the statistical properties of the time intervals between successive points or by those of the number of points in arbitrary time intervals. There are mathematical expressions to link up these two points of view, but they are in many cases too complicated to be used in practice. In this paper we present an algorithmic procedure to obtain the number o...

متن کامل

Limit theorems for geometric functionals of Gibbs point processes

Observations are made on a point process Ξ in R in a window Qλ of volume λ. The observation, or ‘score’ at a point x, here denoted ξ(x, Ξ), is a function of the points within a random distance of x. When the input Ξ is a Poisson or binomial point process, the large λ limit theory for the total score ∑ x∈Ξ∩Qλ ξ(x, Ξ ∩Qλ), when properly scaled and centered, is well understood. In this paper we es...

متن کامل

Algorithms for Segmenting Time Series

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability & Computing

سال: 2023

ISSN: ['0963-5483', '1469-2163']

DOI: https://doi.org/10.1017/s0963548323000251